Development and validation of an improved algorithm for overlaying flexible molecules
نویسندگان
چکیده
A program for overlaying multiple flexible molecules has been developed. Candidate overlays are generated by a novel fingerprint algorithm, scored on three objective functions (union volume, hydrogen-bond match, and hydrophobic match), and ranked by constrained Pareto ranking. A diverse subset of the best ranked solutions is chosen using an overlay-dissimilarity metric. If necessary, the solutions can be optimised. A multi-objective genetic algorithm can be used to find additional overlays with a given mapping of chemical features but different ligand conformations. The fingerprint algorithm may also be used to produce constrained overlays, in which user-specified chemical groups are forced to be superimposed. The program has been tested on several sets of ligands, for each of which the true overlay is known from protein-ligand crystal structures. Both objective and subjective success criteria indicate that good results are obtained on the majority of these sets.
منابع مشابه
Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملA Novel QSAR Model for the Evaluation and Prediction of (E)-N’-Benzylideneisonicotinohydrazide Derivatives as the Potent Anti-mycobacterium Tuberculosis Antibodies Using Genetic Function Approach
Abstract A dataset of (E)-N’-benzylideneisonicotinohydrazide derivatives as a potent anti-mycobacterium tuberculosis has been investigated utilizing Quantitative Structure-Activity Relationship (QSAR) techniques. Genetic Function Algorithm (GFA) and Multiple Linear Regression Analysis (MLRA) were used to select the descriptors and to generate the correlation QSAR models that relate the Mi...
متن کاملAn improved approach to find and rank BCC-efficient DMUs in data envelopment analysis (DEA)
Recently, a mixed integer data envelopment analysis (DEA) model has been proposed to find the most BCC-efficient (or the best) decision making unit (DMU) by Toloo (2012). This paper shows that the model may be infeasible in some cases, and when the model is feasible, it may fail to identify the most efficient DMU, correctly. We develop an improved model to find the most BCC-efficient DMU that r...
متن کاملCritical Path Method for Flexible Job Shop Scheduling Problem with Preemption
This paper addressed a Flexible Job shop Scheduling Problem (FJSP) with the objective of minimization of maximum completion time (Cmax) which job splitting or lot streaming is allowed. Lot streaming is an important technique that has been used widely to reduce completion time of a production system. Due to the complexity of the problem; exact optimization techniques such as branch and bound alg...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کامل